Automath and Pure Type Systems

نویسندگان

Fairouz Kamareddine

Twan Laan

Rob Nederpelt

چکیده

We study the position of Automath systems within the framework of the Pure Type Systems as discussed in 3].

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Pure Type Systems with de Bruijn Indices

Nowadays, type theory has many applications and is used in many different disciplines. Within computer science, logic and mathematics there are many different type systems. They serve several purposes and are formulated in various ways. A general framework called Pure Type Systems (PTSs) has been introduced independently by Terlouw and Berardi in order to provide a unified formalism in which ma...

متن کامل

The Formal System λδ

The formal system λδ is a typed λ-calculus that pursues the unification of terms, types, environments and contexts as the main goal. λδ takes some features from the Automath-related λ-calculi and some from the pure type systems, but differs from both in that it does not include the Π construction while it provides for an abbreviation mechanism at the level of terms. λδ enjoys some important des...

متن کامل

A Unified Approach to Type Theory Through a Refined lambda-Calculus

A-calculus is at the heart of type theory while type theory has heen the most stimulating part of the theory of Computation. The presence however of various type systems provokes attempts at finding a unified way of describing these systems. Barendregt's cube for example, is such an attempt. Based on these observations, we will devise a new A-notation which enables categorising most of the know...

متن کامل

Is ZF a hack?: Comparing the complexity of some (formalist interpretations of) foundational systems for mathematics

This paper presents Automath encodings (which also are valid in LF/λP ) of various kinds of foundations of mathematics. Then it compares these encodings according to their size, to find out which foundation is the simplest. The systems analyzed in this way are two kinds of set theory (ZFC and NF), two systems based on Church’s higher order logic (Isabelle/Pure and HOL), three kinds of type theo...

متن کامل